Distributed Source Coding for Correlated Memoryless Gaussian Sources
نویسنده
چکیده
We consider a distributed source coding problem of L correlated Gaussian observations Yi, i = 1, 2, · · · , L. We assume that the random vector Y L = t(Y1, Y2, · · · , YL) is an observation of the Gaussian random vector X = t(X1, X2, · · · , XK), having the form Y L = AX +N , where A is a L×K matrix and N = t(N1, N2, · · · , NL) is a vector of L independent Gaussian random variables also independent of X . The estimation error on X is measured by the distortion covariance matrix. The rate distortion region is defined by a set of all rate vectors for which the estimation error is upper bounded by an arbitrary prescribed covariance matrix in the meaning of positive semi definite. In this paper we derive explicit outer and inner bounds of the rate distortion region. This result provides a useful tool to study the direct and indirect source coding problems on this Gaussian distributed source coding system, which remain open in general.
منابع مشابه
Distributed Joint Source-Channel Coding for arbitrary memoryless correlated sources and Source coding for Markov correlated sources using LDPC codes
In this paper, we give a distributed joint source channel coding scheme for arbitrary correlated sources for arbitrary point in the Slepian-Wolf rate region, and arbitrary link capacities using LDPC codes. We consider the Slepian-Wolf setting of two sources and one destination, with one of the sources derived from the other source by some correlation model known at the decoder. Distributed enco...
متن کاملOn Transmission of Two Correlated Gaussian Memoryless Sources over a Gaussian MAC using Delay-Free Mappings
This paper considers delay-free, low complexity, joint source-channel coding (JSCC) for communication of two correlated Gaussian memoryless sources over a Gaussian Multiple Access Channel (GMAC). Schemes are proposed both for cooperative and distributed encoders. The cooperative case is mainly studied to get an idea about how close one can expect to get to the performance upper bound with a zer...
متن کاملJoint Source–Channel Coding Excess Distortion Exponent for Some Memoryless Continuous-Alphabet Systems
We investigate the joint source–channel coding (JSCC) excess distortion exponent (the exponent of the probability of exceeding a prescribed distortion level) for some memoryless communication systems with continuous alphabets. We first establish upper and lower bounds for for systems consisting of a memoryless Gaussian source under the squared-error distortion fidelity criterion and a memoryles...
متن کاملSecond-Order Coding Rates for Conditional Rate-Distortion
This paper characterizes the second-order coding rates for lossy source coding with side information available at both the encoder and the decoder. We first provide non-asymptotic bounds for this problem and then specialize the non-asymptotic bounds for three different scenarios: discrete memoryless sources, Gaussian sources, and Markov sources. We obtain the second-order coding rates for these...
متن کاملDistributed Source Coding of Correlated Gaussian Sources
We consider the distributed source coding system of L correlated Gaussian sources Yl, l = 1, 2, · · · , L which are noisy observations of correlated Gaussian remote sources Xk, k = 1, 2, · · · ,K. We assume that Y L = (Y1, Y2, · · · , YL) is an observation of the source vector X = (X1, X2, · · · , XK), having the form Y L = AX+N, where A is a L×K matrix and N = (N1, N2, · · · , NL) is a vector ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0908.3982 شماره
صفحات -
تاریخ انتشار 2009